A Quantitative Analysis of Tile Size Selection Algorithms
نویسندگان
چکیده
منابع مشابه
Adaptive Models for Tile Size Selection
Tiling (or blocking) is widely used to exploit data locality and coarse-grained parallelism. Tile sizes significantly influence the performance and several models have been proposed for tile size selection. However, with advances in hardware and compiler optimizations, previous models are no longer effective. Developing efficient models each time the hardware or compiler changes require extensi...
متن کاملAnalytical Bounds for Optimal Tile Size Selection
In this paper, we introduce a novel approach to guide tile size selection by employing analytical models to limit empirical search within a subspace of the full search space. Two analytical models are used together: 1) an existing conservative model, based on the data footprint of a tile, which ignores intra-tile cache block replacement, and 2) an aggressive new model that assumes optimal cache...
متن کاملNeural Network Assisted Tile Size Selection
Abstract. Data locality optimization plays a significant role in reducing the execution time of many loop-intensive kernels. Loop tiling at various levels is often used to effectively exploit data locality in deep memory hierarchies. The recent development of frameworks for parametric loop tiling of user code has lead to a widening of the range of applications that could benefit from auto-tunin...
متن کاملTile Selection Algorithms and Their Performance Models
Loop tiling is an effective optimizing transformation to reduce the memory access cost of a program, especially for dense matrix computations. However, the success of loop tiling is heavily dependent on the appropriate selection of tile shapes and sizes. In this paper we examine several existing tile selection algorithms in a unified framework, and quantify their performance improvements for th...
متن کاملImpact of Tile-Size Selection for Skewed Tiling
Tile-size selection is known to be a complex problem. Thjs paper develops a new selecbion algorithm. Unlike previous algorithms, this new algorithm considers the effect of loop skewing on cache miss-. It also estimates loop overhead and incorporates them into the execution cost model, which turns out to be critical to the decision between tiling a single loop level vs. tiling two loop levels. O...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Supercomputing
سال: 2004
ISSN: 0920-8542
DOI: 10.1023/b:supe.0000011388.54204.8e